A Reliable Protocol for Synchronous Rendezvous (note)

نویسندگان

  • Lucian Wischik
  • Damon Wischik
چکیده

In the presence of failure, any protocol for distributed atomic commitment necessarily has a ‘window of vulnerability’ where the crash of one party makes other parties block. This vulnerability turns out not so serious in one special case – that of synchronous rendezvous. Rendezvous is important because it is the basis for process calculi, which themselves underpin several new experimental languages and also web services. We give a simplified three phase commit protocol specially tailored to rendezvous. In the presence of arbitrary message loss and permanent site failure, the protocol is strongly non-blocking for one party – the party can always unblock immediately. This is useful for writing a reliable non-blocking web service. If message loss is fair and site failure is not permanent, then the protocol is also weakly non-blocking for the other party – the chance of it remaining blocked tends to zero as time increases. (This yields a solution to the classic ‘Two Generals’ problem, which is a degenerate case of rendezvous). The proof of non-blocking uses a novel technique involving Markov processes. It is a general technique that applies to any calculus and any implementation with message loss, so long as the two are bisimilar.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method to Convert Concurrent EFSMs with Multi-Rendezvous into Synchronous Sequential Circuit

In this paper, we propose a technique to synthesize a hardware circuit from a protocol specification consisting of several concurrent EFSMs with multi-rendezvous specified among their subsets. In our class, each multi-rendezvous can be specified among more than two EFSMs, and several multi-rendezvous can be specified for different combinations of EFSMs. In the proposed technique, using the info...

متن کامل

Scheduling globally asynchronous locally synchronous systems for guaranteed response times

This paper analyzes and schedules Globally Asynchronous Locally Synchronous (GALS) programs to bound response times to input events. The proposed approach is applicable to scheduling of GALS programs for different target architectures with single or multiple processors or cores. A Satisfiability Modulo Theoretical (SMT) formulation in the quantifier free linear real arithmetic (QF LRA) logic is...

متن کامل

Hardware synthesis from protocol specifications in LOTOS

In this paper, we propose a technique for hardware implementation of protocol specifications in LOTOS. For the purpose, we define a new model called synchronous EFSMs consisting of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets, and propose a conversion algorithm from a subset of LOTOS. The derived synchronous EFSMs can be easily implemented as a synchrono...

متن کامل

Toward Efficient Channel Hopping for Communication Rendezvous in Dynamic Spectrum Access Networks

—We present ETCH, efficient channel hopping based MAC-layer protocols for communication rendezvous in Dynamic Spectrum Access (DSA) networks. Compared to the existing solutions, ETCH fully utilizes spectrum diversity in communication rendezvous by allowing all the rendezvous channels to be utilized at the same time. We propose two protocols, SYNC-ETCH, which is a synchronous protocol assuming D...

متن کامل

Rendezvous of Two Robots with Constant Memory

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003